home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Turnbull China Bikeride
/
Turnbull China Bikeride - Disc 2.iso
/
BARNET
/
COMPILER
/
SATHER
/
!Sather
/
Library
/
Containrs
/
sa
/
stack
< prev
next >
Wrap
Text File
|
1996-07-16
|
1KB
|
49 lines
---------------------------> Sather 1.1 source file <--------------------------
-- Author: Benedict A. Gomes <gomes@icsi.berkeley.edu>
-- Copyright (C) 1995, International Computer Science Institute
-- $Id: stack.sa,v 1.5 1996/07/16 04:38:17 holger Exp $
--
-- COPYRIGHT NOTICE: This code is provided WITHOUT ANY WARRANTY
-- and is subject to the terms of the SATHER LIBRARY GENERAL PUBLIC
-- LICENSE contained in the file: Sather/Doc/License of the
-- Sather distribution. The license is also available from ICSI,
-- 1947 Center St., Suite 600, Berkeley CA 94704, USA.
-------------------------------------------------------------------
abstract class $STACK{T} < $NR_STACK{T}, $REENTRANT is --NR:
--NR: abstract class $NR_STACK{T} < $DISPENSER{T} is
-- An abstract stack
-- size: INT;
-- current: T;
-- remove: T;
-- elt!: T;
-- str: STR;
-- copy: SAME
-- has(e: T): BOOL;
push(elt: T);
-- Push elt to the top of the stack
pop: T;
-- Return and remove the topmost element
top: T;
-- Return the topmost element
size: INT;
-- Number of elements in the stack
is_empty: BOOL;
-- True if size = 0
elt!: T;
-- Return the elements in the order in which successive "pop"s
-- would yield them without actually removing the elements
copy: SAME; --NR: copy: SAME;
-- Return a copy of the stack
end; -- abstract class $NR_STACK{T}
-------------------------------------------------------------------